Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("BOOLEAN FUNCTION")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1626

  • Page / 66
Export

Selection :

  • and

SEVERE GEOMAGNETIC STORMS AND THEIR SOURCES ON THE SUNKRAJCOVIC S; KRIVSKY L.1982; BULL. ASTRON. INST. CZECH.; ISSN 0004-6248; CSK; DA. 1982; VOL. 33; NO 1; PP. 47-59; ABS. RUS; BIBL. 18 REF.Article

ON GENERALIZED BOOLEAN FUNCTIONS ITANDAREANU N.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 34; NO 3; PP. 293-299; BIBL. 2 REF.Article

SPERNER TYPE THEOREMS AND COMPLEXITY OF MINIMAL DISJUNCTIVE NORMAL FORMS OF MONOTONE BOOLEAN FUNCTIONSGRONAU HDOF.1981; PERIOD. MATH. HUNG.; ISSN 0031-5303; HUN; DA. 1981; VOL. 12; NO 4; PP. 267-282; BIBL. 16 REF.Article

THRESHOLD NUMBERS AND THRESHOLD COMPLETIONSHAMMER PL; IBARAKI T; PELED U et al.1980; ANN. DISCRETE MATH.; NLD; DA. 1980; VOL. 9; PP. 103-106; BIBL. 5 REF.Article

ON THE NUMBER OF PRIME IMPLICANTSCHANDRA AK; MARKOWSKY G.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 24; NO 1; PP. 7-11; BIBL. 7 REF.Article

REDUCIBILITY AS A TOOL TO EXTEND THE POWER OF APPROXIMATION ALGORITHMS. THE MINIMIZATION OF BOOLEAN EXPRESSIONS.AIELLO A; BURATTINI E; MASSAROTTI A et al.1977; R.A.I.R.O., INFORMAT. THEOR.; FR.; DA. 1977; VOL. 11; NO 1; PP. 75-82; ABS. FR.; BIBL. 7 REF.Article

NUMBER OF SPECTRAL COEFFICIENTS NECESSARY TO IDENTIFY A CLASS OF BOOLEAN FUNCTIONSMUZIO J; MILLER DM; HURST SL et al.1982; ELECTRON. LETT.; ISSN 0013-5194; GBR; DA. 1982; VOL. 18; NO 3; PP. 577-578; BIBL. 10 REF.Article

THE MAPPING OF SPECTRAL COEFFICIENTS AND ITS APPLICATIONCHEN X.1982; COMPUTERS & ELECTRICAL ENGINEERING; ISSN 0045-7906; USA; DA. 1982; VOL. 9; NO 3-4; PP. 167-180; BIBL. 18 REF.Article

SUR LE CARDINAL MAXIMUM DE LA BASE COMPLETE D'UNE FONCTION BOOLEENNE, EN FONCTION DU NOMBRE DE CONJONCTIONS DE L'UNE DE SES FORMES NORMALESLABORDE JM.1980; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1980; VOL. 32; NO 2; PP. 209-212; ABS. ENG; BIBL. 2 REF.Article

THE BOOLEAN ALGEBRA WITH RESTRICTED VARIABLES AS A TOOL FOR FAULT TREE MODULARIZATIONCALDAROLA L; WICKENHAEUSER A.1981; KERNFORSCHUNGSZENT. KARLSR.; ISSN 0303-4003; DEU; DA. 1981; NO 3190; PP. 1-62; ABS. GER; BIBL. 16 REF.Serial Issue

ON THE FIXING GROUP FOR A TOTALLY PRE-ORDERED BOOLEAN FUNCTIONUEDA T.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 26; NO 3; PP. 293-295; BIBL. 6 REF.Article

ON PROBABILITY FUNCTION ON PSEUDO-BOOLEAN ALGEBRABULATOVIC J.1978; PUBL. INST. MATH.; YUG; DA. 1978; VOL. 24; PP. 29-38; BIBL. 1 REF.Article

CALCUL DES FONCTIONS BOOLEENNES PAR DENOMBREMENT DES VALEURS DE VERITE DES VARIABLESLUK'YANOV BV.1982; IZV. AKAD. NAUK SSSR, TEH. KIBERN.; ISSN 0002-3388; SUN; DA. 1982; NO 1; PP. 142-147; BIBL. 3 REF.Article

ON THE COMPLEXITY OF 2-OUTPUT BOOLEAN NETWORKSGALBIATI G; FISCHER MJ.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 2; PP. 177-185; BIBL. 14 REF.Article

SUR LES ESTIMATIONS DE LA COMPLEXITE DE LA REALISATION DES FORMULES BOOLEENNES PAR DES CIRCUITS ARBORESCENTS A MODULES ADAPTATIFSARTYUKHOV VL; KOPEJKIN GA; SHALYTO AA et al.1981; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1981; NO 11; PP. 124-130; ABS. ENG; BIBL. 5 REF.Article

QUASIMONOTONE BOOLEAN FUNCTIONS AND BISTELLAR GRAPHSHAMMER PL; SIMEONE B.1980; ANN. DISCRETE MATH.; NLD; DA. 1980; VOL. 9; PP. 107-119; BIBL. 6 REF.Article

WALSH SPECTRUM OF MONOTONE BOOLEAN FUNCTIONSKEKRE HB; SAHASRABUDHE SC; RAMARAO V et al.1981; IEEE TRANS. ELECTROMAGN. COMPAT.; ISSN 0018-9375; USA; DA. 1981; VOL. 23; NO 3; PART. 1; PP. 156-160; BIBL. 5 REF.Article

SUR LA CONSTRUCTION PAR DES AUTOMATES CELLULAIRES LINEAIRESBLYUMIN SL.1981; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1981; NO 11; PP. 131-138; ABS. ENG; BIBL. 7 REF.Article

DETERMINATION DES LOIS D'IMPLICATION DANS L'ESPACE BOOLEEN DES CRITERES ET RECONNAISSANCE DES FORMESZAKREVSKIJ AD.1982; KIBERNETIKA; UKR; DA. 1982; NO 1; PP. 1-6; ABS. ENG; BIBL. 12 REF.Article

ON THE NUMBER OF AFFINE FAMILIES OF BOOLEAN FUNCTIONSBALAKRISHNAN KRISHNAMURTHY; MOLL RN.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 3; PP. 327-337; BIBL. 6 REF.Article

SIZE DEPTH TRADEOFF IN BOOLEAN FORMULES.COMMENTZ WALTER B.1978; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 125-141; BIBL. 19 REF.; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)Conference Paper

BOUNDS ON THE NUMBER OF FUZZY FUNCTIONS.KAMEDA T; SADEH E.1977; INFORM. AND CONTROL; U.S.A.; DA. 1977; VOL. 35; NO 2; PP. 139-145; BIBL. 6 REF.Article

A Note on a Conjecture for Balanced Elementary Symmetric Boolean FunctionsWEI SU; XIAOHU TANG; POTT, Alexander et al.IEEE transactions on information theory. 2013, Vol 59, Num 1, pp 665-671, issn 0018-9448, 7 p.Article

A note on symmetric boolean functions with maximum algebraic immunity in odd number of variablesLONGJIANG QU; CHAO LI; KEQIN FENG et al.IEEE transactions on information theory. 2007, Vol 53, Num 8, pp 2908-2910, issn 0018-9448, 3 p.Article

A COMBINATORIAL LIMIT TO THE COMPUTING POWER OF VLSI CIRCUITSVUILLEMIN J.1983; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1983; VOL. 32; NO 3; PP. 294-300; BIBL. 15 REF.Article

  • Page / 66